Distance Desert Automata and Star Height Substitutions
نویسندگان
چکیده
We introduce the notion of nested distance desert automata as a joint generalization and further development of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22 O(n2) space whether the language accepted by an n-state non-deterministic automaton is of a star height less than a given integer h (concerning rational expressions with union, concatenation and iteration). We also show some decidability results for some substitution problems for recognizable languages.
منابع مشابه
Distance Desert Automata and the Star Height One Problem
We show that it is decidable in time complexity 2 2O(n) whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star height one problem. To achieve this, we introduce distance desert automata as a joint generalization of distance automata and desert automata, and show the decidability of its limitedness pro...
متن کاملThe Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Given a Rabin tree-language and natural numbers i, j, the language is said to be i, j-feasible if it is accepted by a parity automaton using priorities {i, i+1, ..., j}. The i, j-feasibility induces a hierarchy over the Rabin-tree languages called the Mostowski hierarchy. In this paper we prove that the problem of deciding if a language is i, j-feasible is reducible to the uniform universality ...
متن کاملThe Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem
In this paper we lift the result of Hashiguchi of decidability of the restricted star-height problem for words to the level of finite trees. Formally, we show that it is decidable, given a regular tree language L and a natural number k whether L can be described by a disjunctive μ-calculus formula with at most k nesting of fixpoints. We show the same result for disjunctive μ-formulas allowing s...
متن کاملDesert Automata V. On the Complexity of the Relative Inclusion Star Height Problem
Given a family of recognizable languages L1, . . . , Lm and recognizable languages K1 ⊆ K2, the relative inclusion star height problem means to compute the minimal star height of some rational expression r over L1, . . . , Lm satisfying K1 ⊆ L(r) ⊆ K2. We show that this problem is of elementary complexity and give a detailed analysis its complexity depending on the representation of K1 and K2 a...
متن کاملRegular Cost Functions, Part I: Logic and Algebra over Words
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the two values “inside” and “outside”. This theory is a continuation of the works on distance automata and similar models. These models of automata h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006